A chain-cluster based routing algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are an emerging technology for monitoring physical world. Different from the traditional wireless networks and ad hoc networks, the energy constraint of WSNs makes energy saving become the most important goal of various routing algorithms. For this purpose, a cluster based routing algorithm LEACH (low energy adaptive clustering hierarchy) has been proposed to organize a sensor network into a set of clusters so that the energy consumption can be evenly distributed among all the sensor nodes. Periodical cluster head voting in LEACH, however, consumes non-negligible energy and other resources. While another chain-based algorithm PEGASIS (powerefficient gathering in sensor information systems) can reduce such energy consumption, it causes a longer delay for data transmission. In this paper, we propose a routing algorithm called CCM (Chain-Cluster based Mixed routing), which makes full use of the advantages of LEACH and PEGASIS, and provide improved performance. It divides a WSN into a few chains and runs in two stages. In the first stage, sensor nodes in each chain transmit data to their own chain head node in parallel, using an improved chain routing protocol. In the second stage, all chain head nodes group as a cluster in a selforganized manner, where they transmit fused data to a voted cluster head using the cluster based routing. Experimental F. Tang (B) · M. Guo · Y. Ma Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China e-mail: [email protected] I. You School of Information Science, Korean Bible University, Seoul, South Korea F. Tang · S. Guo School of Computer Science and Engineering, The University of Aizu, Fukushima 965-8580, Japan results demonstrate that our CCM algorithm outperforms both LEACH and PEGASIS in terms of the product of consumed energy and delay, weighting the overall performance of both energy consumption and transmission delay.